Synthesizing Inductive Expertise
نویسندگان
چکیده
Instead of attacking inductive inference problems in piecemeal fashion, one might hope to write a program that synthesizes successful inductive inference machines from input problem descriptions. Such synthesizers might be conceived as accepting information from the user about the nature of the problem to be solved. The present paper examines alternative design specifications for synthesizers of this kind. The specifications vary in terms of
منابع مشابه
Synthesizing Number Transformations from Input-Output Examples
Numbers are one of the most widely used data type in programming languages. Number transformations like formatting and rounding present a challenge even for experienced programmers as they find it difficult to remember different number format strings supported by different programming languages. These transformations present an even bigger challenge for end-users of spreadsheet systems like Mic...
متن کاملTowards the Validation of Inductive Learning Systems
The present paper deals with inductive inference of recur-sive functions, in general, and with the problem of validating inductive learning devices, in particular. Thus, the paper aims at a contribution to the research and development area of intelligent systems validation. As those systems are typically interactive and, therefore, utilized in open loops of human{machine interactions, the probl...
متن کاملDomain Expertise vs. Validation Expertise: Essentials of Validating Intelligent Systems
The present short paper deals with fundamental problems in Computer Science, in general, and in Artiicial Intelligence (AI), especially. It addresses the question how to deal with the problem whether or not complex interactive systems really do what they are expected to do. In fact, the focus of the presentation of this paper is even more narrow: The essential reasons why validation expertise u...
متن کاملInductive Databases and Knowledge Scouts
Project Summary Objectives of this research are to develop, implement, and test a methodology for building inductive databases, which extend conventional databases by integrating inductive inference capabilities. These capabilities allow a database to answer queries that require synthesizing plausible knowledge. Such knowledge is not directly or deductively obtainable from the database, but can...
متن کاملHorn-ICE Learning for Synthesizing Invariants and Contracts
We design learning algorithms for synthesizing invariants using Horn implication counterexamples (Horn-ICE), extending the ICE-learning model. In particular, we describe a decision-tree learning algorithm that learns from Horn-ICE samples, works in polynomial time, and uses statistical heuristics to learn small trees that satisfy the samples. Since most verification proofs can be modeled using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 77 شماره
صفحات -
تاریخ انتشار 1988